منابع مشابه
Submodular Stochastic Probing on Matroids
In a stochastic probing problem we are given a universe E, where each element e ∈ E is active independently with probability pe ∈ [0, 1], and only a probe of e can tell us whether it is active or not. On this universe we execute a process that one by one probes elements — if a probed element is active, then we have to include it in the solution, which we gradually construct. Throughout the proc...
متن کاملNon-negative submodular stochastic probing via stochastic contention resolution schemes
In a stochastic probing problem we are given a universe E, where each element e ∈ E isactive independently with probability pe ∈ [0, 1], and only a probe of e can tell us whether itis active or not. On this universe we execute a process that one by one probes elements —if a probed element is active, then we have to include it in the solution, which we graduallyconstruct. Thr...
متن کاملMatchings, matroids and submodular functions
This thesis focuses on three fundamental problems in combinatorial optimization: non-bipartite matching, matroid intersection, and submodular function minimization. We develop simple, efficient, randomized algorithms for the first two problems, and prove new lower bounds for the last two problems. For the matching problem, we give an algorithm for constructing perfect or maximum cardinality mat...
متن کاملAdaptivity Gaps for Stochastic Probing: Submodular and XOS Functions
Suppose we are given a submodular function f over a set of elements, and we want to maximize its value subject to certain constraints. Good approximation algorithms are known for such problems under both monotone and non-monotone submodular functions. We consider these problems in a stochastic setting, where elements are not all active and we can only get value from active elements. Each elemen...
متن کاملWord Alignment via Submodular Maximization over Matroids
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment components while remaining computationally efficient, thanks to the power and generality of submodular functions. We show that submodularity naturally arises when modeling word fertility. Experiments on the English-French Hansa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2016
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2015.0766